On First Order Interval Temporal Logic
نویسنده
چکیده
منابع مشابه
A Complete Proof System for First-order Interval Temporal Logic with Projection
This paper presents an ω-complete proof system for the extension of first order Interval Temporal Logic (ITL, [12, 15, 4]) by a projection operator [16, 11]. Alternative earlier approaches to the axiomatisation of projection in ITL are briefly presented and discussed. An extension of the proof system which is complete for the extension of Duration Calculus (DC , [24]) by projection is also given.
متن کاملRankers over Infinite Words
We consider the fragments FO, Σ2 ∩ FO, Π2 ∩ FO, and ∆2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of rankers. In particular, we generalize the notion of a ranker to infinite words in two possible ways. Both extensions are natural in the sense that over finite words, they coincide with classical rankers and over infinite ...
متن کاملMining First-Order Temporal Interval Patterns with Regular Expression Constraints
Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of first order temporal pattern, specified in Allen’s Temporal Interval Logic, where time is explicitly represented by intervals. We present the algorithm MILPRIT for mining temporal interval patterns, which uses variants o...
متن کاملA General Tableau Method for Propositional Interval Temporal Logics
In this paper, we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau met...
متن کامل